Forcing Independent Domination Number of a Graph
نویسندگان
چکیده
منابع مشابه
Outer independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملIndependent Domination Number and Chromatic Number of a Fuzzy Graph
Let be a simple undirected fuzzy graph. A subset S of V is called a dominating set in G if every vertex in V-S is effectively adjacent to at least one vertex in S. A dominating set S of V is said to be a Independent dominating set if no two vertex in S is adjacent. The independent domination number of a fuzzy graph is denoted by (G) which is the smallest cardinality of a independent dominating ...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملDOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملDomination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2019
ISSN: 1307-5543
DOI: 10.29020/nybg.ejpam.v12i4.3484